theorem, stretch of a pseudorandom generator #cryptography Theorem If PRG G:{0,1}n→{0,1}n+1G : \{0,1\}^n \to \{0,1\}^{n+1}, then ∀ℓ(n)=poly(n)\forall \ell(n) = \operatorname{poly}(n), PRG #incomplete